The GLOM architecture proposed by Hinton [2021] is a recurrent neural network for parsing an image into a hierarchy of wholes and parts. When a part is ambiguous, GLOM assumes that the ambiguity can be resolved by allowing the part to make multi-modal predictions for the pose and identity of the whole to which it belongs and then using attention to similar predictions coming from other possibly ambiguous parts to settle on a common mode that is predicted by several different parts. In this study, we describe a highly simplified version of GLOM that allows us to assess the effectiveness of this way of dealing with ambiguity. Our results show that, with supervised training, GLOM is able to successfully form islands of very similar embedding vectors for all of the locations occupied by the same object and it is also robust to strong noise injections in the input and to out-of-distribution input transformations.
translated by 谷歌翻译
A capsule is a group of neurons whose activity vector represents the instantiation parameters of a specific type of entity such as an object or an object part. We use the length of the activity vector to represent the probability that the entity exists and its orientation to represent the instantiation parameters. Active capsules at one level make predictions, via transformation matrices, for the instantiation parameters of higher-level capsules. When multiple predictions agree, a higher level capsule becomes active. We show that a discrimininatively trained, multi-layer capsule system achieves state-of-the-art performance on MNIST and is considerably better than a convolutional net at recognizing highly overlapping digits. To achieve these results we use an iterative routing-by-agreement mechanism: A lower-level capsule prefers to send its output to higher level capsules whose activity vectors have a big scalar product with the prediction coming from the lower-level capsule.
translated by 谷歌翻译
We present a framework for efficient inference in structured image models that explicitly reason about objects. We achieve this by performing probabilistic inference using a recurrent neural network that attends to scene elements and processes them one at a time. Crucially, the model itself learns to choose the appropriate number of inference steps. We use this scheme to learn to perform inference in partially specified 2D models (variable-sized variational auto-encoders) and fully specified 3D models (probabilistic renderers). We show that such models learn to identify multiple objects -counting, locating and classifying the elements of a scenewithout any supervision, e.g., decomposing 3D images with various numbers of objects in a single forward pass of a neural network at unprecedented speed. We further show that the networks produce accurate inferences when compared to supervised counterparts, and that their structure leads to improved generalization.
translated by 谷歌翻译
The aim of this paper is to introduce a new learning procedure for neural networks and to demonstrate that it works well enough on a few small problems to be worth further investigation. The Forward-Forward algorithm replaces the forward and backward passes of backpropagation by two forward passes, one with positive (i.e. real) data and the other with negative data which could be generated by the network itself. Each layer has its own objective function which is simply to have high goodness for positive data and low goodness for negative data. The sum of the squared activities in a layer can be used as the goodness but there are many other possibilities, including minus the sum of the squared activities. If the positive and negative passes could be separated in time, the negative passes could be done offline, which would make the learning much simpler in the positive pass and allow video to be pipelined through the network without ever storing activities or stopping to propagate derivatives.
translated by 谷歌翻译
Dynamic evaluation of language models (LMs) adapts model parameters at test time using gradient information from previous tokens and substantially improves LM performance. However, it requires over 3x more compute than standard inference. We present Fast Weight Layers (FWLs), a neural component that provides the benefits of dynamic evaluation much more efficiently by expressing gradient updates as linear attention. A key improvement over dynamic evaluation is that FWLs can also be applied at training time so the model learns to make good use of gradient updates. FWLs can easily be added on top of existing transformer models, require relatively little extra compute or memory to run, and significantly improve language modeling perplexity.
translated by 谷歌翻译
2022-10-12
Panoptic segmentation assigns semantic and instance ID labels to every pixel of an image. As permutations of instance IDs are also valid solutions, the task requires learning of high-dimensional one-to-many mapping. As a result, state-of-the-art approaches use customized architectures and task-specific loss functions. We formulate panoptic segmentation as a discrete data generation problem, without relying on inductive bias of the task. A diffusion model based on analog bits is used to model panoptic masks, with a simple, generic architecture and loss function. By simply adding past predictions as a conditioning signal, our method is capable of modeling video (in a streaming setting) and thereby learns to track object instances automatically. With extensive experiments, we demonstrate that our generalist approach can perform competitively to state-of-the-art specialist methods in similar settings.
translated by 谷歌翻译
前列腺活检和图像引导的治疗程序通常是在与磁共振图像（MRI）的超声指导下进行的。准确的图像融合依赖于超声图像上前列腺的准确分割。然而，超声图像中降低的信噪比和工件（例如，斑点和阴影）限制了自动前列腺分割技术的性能，并将这些方法推广到新的图像域是本质上很难的。在这项研究中，我们通过引入一种新型的2.5D深神经网络来解决这些挑战，用于超声图像上的前列腺分割。我们的方法通过组合有监督的域适应技术和知识蒸馏损失，解决了转移学习和填充方法的局限性（即，在更新模型权重时，在更新模型权重时的性能下降）。知识蒸馏损失允许保留先前学习的知识，并在新数据集上的模型填充后降低性能下降。此外，我们的方法依赖于注意模块，该模块认为模型特征定位信息以提高分割精度。我们对一个机构的764名受试者进行了培训，并仅使用后续机构中的十个受试者对我们的模型进行了审核。我们分析了方法在三个大型数据集上的性能，其中包括来自三个不同机构的2067名受试者。我们的方法达到了平均骰子相似性系数（骰子）为$ 94.0 \ pm0.03 $，而Hausdorff距离（HD95）为2.28 $ mm $，在第一机构的独立受试者中。此外，我们的模型在其他两个机构的研究中都很好地概括了（骰子：$ 91.0 \ pm0.03 $; hd95：3.7 $ mm $ and Dice：$ 82.0 \ pm0.03 $; hd95 $; hd95：7.1 $ mm $）。
translated by 谷歌翻译
我们提出了位扩散：一种简单而通用的方法，用于通过连续扩散模型生成离散数据。我们方法背后的主要思想是首先将离散数据表示为二进制位，然后训练连续扩散模型，以将这些位模拟为实数，我们称为模拟位。为了生成样品，模型首先生成模拟位，然后将其阈值阈值以获得表示离散变量的位。我们进一步提出了两种简单的技术，即自我调节和不对称的时间间隔，从而导致样本质量的显着改善。尽管它很简单，但提出的方法可以在离散图像生成和图像字幕任务中实现强大的性能。对于离散图像生成，我们在CIFAR-10（具有3K离散的8位代币）和Imagenet-64x64（具有12K离散的8位代币）上都显着改善了先前的最新技术，超过了最好的自动回归性自动回应。样品质量（通过FID衡量）和效率的模型。对于MS-Coco数据集上的图像字幕，与自回归模型相比，我们的方法可实现竞争成果。
translated by 谷歌翻译
尽管语言任务自然而然地以单个，统一的建模框架（即生成代币序列）表示，但在计算机视觉中并非如此。结果，对于不同的视力任务，不同的架构和损失功能的扩散。在这项工作中，我们表明，如果根据共享像素到序列界面进行配制，也可以统一一组“核心”计算机视觉任务。我们专注于四个任务，即对象检测，实例分割，关键点检测和图像字幕，所有这些任务都具有各种类型的输出，例如边界框或密集的掩码。尽管如此，通过将每个任务的输出作为具有统一界面的离散令牌的顺序，我们表明可以在所有这些任务上训练具有单个模型体系结构和损失功能的神经网络，而没有特定于任务的自定义。为了解决特定的任务，我们使用一个简短的提示作为任务说明，序列输出适应提示，以便它可以产生特定于任务的输出。我们表明，与成熟的特定任务模型相比，这种模型可以实现竞争性能。
translated by 谷歌翻译
医疗人工智能（AI）的最新进展已提供了可以达到临床专家水平绩效的系统。但是，当在与训练环境不同的临床环境中评估时，这种系统往往会证明次优的“分布式”性能。一种常见的缓解策略是使用特定地点数据为每个临床环境开发单独的系统[1]。但是，这很快变得不切实际，因为医疗数据很耗时，可以注释且昂贵[2]。因此，“数据有效概括”的问题给医学AI开发带来了持续的困难。尽管代表性学习的进展显示出希望，但并未对其好处进行严格的研究，特别是用于分布的设置。为了应对这些挑战，我们提出了RESEDIS，这是一种统一的代表学习策略，以提高医学成像AI的鲁棒性和数据效率。雷雷迪斯使用大规模监督转移学习与自我监督学习的通用组合，几乎不需要特定于任务的自定义。我们研究各种医学成像任务，并使用回顾性数据模拟三个现实的应用程序场景。 RESEDIS表现出明显改善的分布性能，而在强有力的基线上，诊断准确性相对相对提高了11.5％。更重要的是，我们的策略会导致对医学成像AI的强大数据有效的概括，并使用跨任务的1％至33％的重新培训数据匹配强有力的监督基线。这些结果表明，Repedis可以显着加速医学成像AI开发的生命周期，从而为医学成像AI提供了重要的一步，以产生广泛的影响。
translated by 谷歌翻译